Fixed-parameter decidability: Extending parameterized complexity analysis
نویسندگان
چکیده
منابع مشابه
Parameterized Complexity of Fixed Variable Logics
We study the complexity of model checking formulas in first-order logic parameterized by the number of distinct variables in the formula. This problem, which is not known to be fixedparameter tractable, resisted to be properly classified in the context of parameterized complexity. We show that it is complete for a newly-defined complexity class that we propose as an analog of the classical clas...
متن کاملFixed-Parameter Complexity and Cryptography
We discuss the issue of the parameterized computational complexity of a number of problems of interest in cryptography. We show that the problem of determining whether an n-digit number has a prime divisor less than or equal to n k can be solved in expected time f(k)n 3 by a randomized algorithm that employs elliptic curve factorization techniques (this result depends on an unproved but plausib...
متن کاملFixed-Parameter Tractability and Parameterized Complexity, Applied to Problems From Computational Social Choice
This supplement provides a brief introduction to the field of fixed-parameter tractability and parameterized complexity. Some basic notions are explained and some related results are presented, with a focus on problems arising in the field of computational social choice. 1 Fixed-Parameter Tractability and Parameterized Complexity The study of fixed-parameter tractability and parameterized compl...
متن کاملThe Fixed - Parameter Complexity of the LCS
The Longest common subsequence problem is examined from the point of view of parameterized computational complexity. There are several diierent ways in which parameters enter the problem, such as the number of sequences to be analyzed, the length of the common subsequence, and the size of the alphabet. Lower bounds on the complexity of this basic problem imply lower bounds on a number of other ...
متن کاملOn Fixed-Parameter Complexity of Infinite Games
We investigate and classify fixed parameter complexity of several infinite duration games, including Rabin, Streett, Muller, parity, mean payoff, and simple stochastic, using different natural parameterizations. Most known fixed parameter intractable games are PSPACEor EXP-complete classically, AW [∗] or XP-hard parametrically, and are all finite duration games. In contrast, the games we consid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Logic Quarterly
سال: 2016
ISSN: 0942-5616
DOI: 10.1002/malq.201500077